Spectral Densest Subgraph and Independence Number of a Graph
نویسندگان
چکیده
In this paper, we study spectral versions of the densest subgraph problem and the largest independence subset problem. In the first part, we give an algorithm for identifying small subgraphs with large spectral radius. We also prove a Hoffman-type ratio bound for the order of an induced subgraph whose spectral radius is bounded from above.
منابع مشابه
A More Complicated Hardness Proof for Finding Densest Subgraphs in Bounded Degree Graphs
We consider the Densest-Subgraph problem, where a graph and an integer k is given and we search for a subgraph on exactly k vertices that induces the maximum number of edges. We prove that this problem is NP-hard even when the input graph has maximum degree three.
متن کاملAn algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems
We investigate the computational complexity of the Densest k-Subgraph problem, where the input is an undirected graph G = (V,E) and one wants to find a subgraph on exactly k vertices with the maximum number of edges. We extend previous work on Densest k-Subgraph by studying its parameterized complexity for parameters describing the sparseness of the input graph and for parameters related to the...
متن کاملSDP-Hardness of Approximation for Densest k-subgraph
Densest k-subgraph is the problem of finding, giving a graph G and a number k, a k vertex subgraph of G with as many edges as possible. The best known poly-time algorithm for this problem gives a factor n1/4 approximation. Proving even constant factor hardness of approximation results for this problem has been done only with significantly stronger assumptions that P , NP. In 2011, however, Bhas...
متن کاملApplications of Uniform Sampling: Densest Subgraph and Beyond
Recently [Bhattacharya et al., STOC 2015] [2] provide the first non-trivial algorithm for the densest subgraph problem in the streaming model with additions and deletions to its edges, i.e., for dynamic graph streams. They present a (0.5−ǫ)-approximation algorithm using Õ(n) space, where factors of ǫ and log(n) are suppressed in the Õ notation. However, the update time of this algorithm is larg...
متن کاملOn the densest k-subgraph problem
Given an n-vertex graph G and a parameter k, we are to nd a k-vertex subgraph with the maximum number of edges. This problem is N P-hard. We show that the problem remains N P-hard even when the maximum degree in G is three. When G contains a k-clique, we give an algorithm that for any > 0 nds a k-vertex subgraph with at least (1 ?) ? k 2 edges, in time n O((1+log n k)==). We study the applicabi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. UCS
دوره 13 شماره
صفحات -
تاریخ انتشار 2007